PROTECTION STRATEGIES FOR CRITICAL RETAIL FACILITIES : APPLYING INTERDICTION MEDIAN AND MAXIMAL COVERING PROBLEMS WITH FORTIFICATION

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Packing Interdiction and Partial Covering Problems

In the Packing Interdiction problem we are given a packing LP together with a separate interdiction cost for each LP variable and a global interdiction budget. Our goal is to harm the LP: which variables should we forbid the LP from using (subject to forbidding variables of total interdiction cost at most the budget) in order to minimize the value of the resulting LP? Interdiction problems on g...

متن کامل

An exact Method for Stochastic Maximal Covering Problem of Preventive Healthcare Facilities

Effective preventive healthcare services have a significant role in reducing fatality and medical expenses in all human societies and the level of accessibility of customers to these services can be considered as a measure of their efficiency and effectiveness. The main purpose of this paper is to develop a service network design model of preventive healthcare facilities with the principal obje...

متن کامل

The r-interdiction median problem with probabilistic protection and its solution algorithm

This paper discusses the critical infrastructure protection problem in supply systems regarding potential intentional attacks. Considering that the protection of a facility cannot be always successful, we present the r-interdiction median problem with probabilistic protection. Defensive resources are allocated according to the degree of importance of service facilities. Computational experiment...

متن کامل

Maximal Covering Location Problems on networks with regional demand

Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p facilities are sought along the edges of a network so that the expected demand covered is maximized, where ...

متن کامل

Presenting a three-objective model in location-allocation problems using combinational interval full-ranking and maximal covering with backup model

Covering models have found many applications in a wide variety of real-world problems; nevertheless, some assumptions of covering models are not realistic enough. Accordingly, a general approach would not be able to answer the needs of encountering varied aspects of real-world considerations. Assumptions like the unavailability of servers, uncertainty, and evaluating more factors at the same ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 2013

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.56.38